TSTP Solution File: ITP100^1 by Zipperpin---2.1.9999
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Zipperpin---2.1.9999
% Problem : ITP100^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : NO INFORMATION
% Format : NO INFORMATION
% Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.QrImXoR0qE true
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 05:22:10 EDT 2023
% Result : Theorem 1.44s 0.86s
% Output : Refutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 26 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 25 ( 15 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 137 ( 3 ~; 0 |; 0 &; 125 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 3 ( 3 usr)
% Number of type conns : 15 ( 15 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-3 aty)
% ( 9 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 28 ( 9 ^; 19 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(list_a_type,type,
list_a: $tType ).
thf(a_type,type,
a: $tType ).
thf(listIn1312259492pend_a_type,type,
listIn1312259492pend_a: list_a > ( nat > a ) > nat > a ).
thf(nil_a_type,type,
nil_a: list_a ).
thf(xs_type,type,
xs: list_a ).
thf(nat_type,type,
nat: $tType ).
thf(f_type,type,
f: nat > a ).
thf(append_a_type,type,
append_a: list_a > list_a > list_a ).
thf(x_type,type,
x: a ).
thf(cons_a_type,type,
cons_a: a > list_a > list_a ).
thf(conj_0,conjecture,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ) ).
thf(zf_stmt_0,negated_conjecture,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
inference('cnf.neg',[status(esa)],[conj_0]) ).
thf(zip_derived_cl67,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ nil_a ) @ ( listIn1312259492pend_a @ xs @ f ) ) ),
inference(cnf,[status(esa)],[zf_stmt_0]) ).
thf(fact_151_i__append__assoc,axiom,
! [Xs: list_a,Ys2: list_a,F: nat > a] :
( ( listIn1312259492pend_a @ Xs @ ( listIn1312259492pend_a @ Ys2 @ F ) )
= ( listIn1312259492pend_a @ ( append_a @ Xs @ Ys2 ) @ F ) ) ).
thf(zip_derived_cl52,plain,
( !!
@ ^ [Y0: list_a] :
( !!
@ ^ [Y1: list_a] :
( !!
@ ^ [Y2: nat > a] :
( ( listIn1312259492pend_a @ Y0 @ ( listIn1312259492pend_a @ Y1 @ Y2 ) )
= ( listIn1312259492pend_a @ ( append_a @ Y0 @ Y1 ) @ Y2 ) ) ) ) ),
inference(cnf,[status(esa)],[fact_151_i__append__assoc]) ).
thf(zip_derived_cl179,plain,
! [X2: list_a] :
( !!
@ ^ [Y0: list_a] :
( !!
@ ^ [Y1: nat > a] :
( ( listIn1312259492pend_a @ X2 @ ( listIn1312259492pend_a @ Y0 @ Y1 ) )
= ( listIn1312259492pend_a @ ( append_a @ X2 @ Y0 ) @ Y1 ) ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl52]) ).
thf(zip_derived_cl180,plain,
! [X2: list_a,X4: list_a] :
( !!
@ ^ [Y0: nat > a] :
( ( listIn1312259492pend_a @ X2 @ ( listIn1312259492pend_a @ X4 @ Y0 ) )
= ( listIn1312259492pend_a @ ( append_a @ X2 @ X4 ) @ Y0 ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl179]) ).
thf(zip_derived_cl181,plain,
! [X2: list_a,X4: list_a,X6: nat > a] :
( ( listIn1312259492pend_a @ X2 @ ( listIn1312259492pend_a @ X4 @ X6 ) )
= ( listIn1312259492pend_a @ ( append_a @ X2 @ X4 ) @ X6 ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl180]) ).
thf(zip_derived_cl182,plain,
! [X2: list_a,X4: list_a,X6: nat > a] :
( ( listIn1312259492pend_a @ X2 @ ( listIn1312259492pend_a @ X4 @ X6 ) )
= ( listIn1312259492pend_a @ ( append_a @ X2 @ X4 ) @ X6 ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl181]) ).
thf(fact_186_append__eq__Cons,axiom,
! [X3: a,Xs: list_a] :
( ( append_a @ ( cons_a @ X3 @ nil_a ) @ Xs )
= ( cons_a @ X3 @ Xs ) ) ).
thf(zip_derived_cl66,plain,
( !!
@ ^ [Y0: a] :
( !!
@ ^ [Y1: list_a] :
( ( append_a @ ( cons_a @ Y0 @ nil_a ) @ Y1 )
= ( cons_a @ Y0 @ Y1 ) ) ) ),
inference(cnf,[status(esa)],[fact_186_append__eq__Cons]) ).
thf(zip_derived_cl95,plain,
! [X2: a] :
( !!
@ ^ [Y0: list_a] :
( ( append_a @ ( cons_a @ X2 @ nil_a ) @ Y0 )
= ( cons_a @ X2 @ Y0 ) ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl66]) ).
thf(zip_derived_cl96,plain,
! [X2: a,X4: list_a] :
( ( append_a @ ( cons_a @ X2 @ nil_a ) @ X4 )
= ( cons_a @ X2 @ X4 ) ),
inference(lazy_cnf_forall,[status(thm)],[zip_derived_cl95]) ).
thf(zip_derived_cl97,plain,
! [X2: a,X4: list_a] :
( ( append_a @ ( cons_a @ X2 @ nil_a ) @ X4 )
= ( cons_a @ X2 @ X4 ) ),
inference('simplify nested equalities',[status(thm)],[zip_derived_cl96]) ).
thf(zip_derived_cl183,plain,
( ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f )
!= ( listIn1312259492pend_a @ ( cons_a @ x @ xs ) @ f ) ),
inference(demod,[status(thm)],[zip_derived_cl67,zip_derived_cl182,zip_derived_cl97]) ).
thf(zip_derived_cl184,plain,
$false,
inference(simplify,[status(thm)],[zip_derived_cl183]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP100^1 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.13 % Command : python3 /export/starexec/sandbox2/solver/bin/portfolio.lams.parallel.py %s %d /export/starexec/sandbox2/tmp/tmp.QrImXoR0qE true
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 15:38:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % Running portfolio for 300 s
% 0.13/0.35 % File : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.35 % Number of cores: 8
% 0.13/0.35 % Python version: Python 3.6.8
% 0.13/0.35 % Running in HO mode
% 0.21/0.66 % Total configuration time : 828
% 0.21/0.66 % Estimated wc time : 1656
% 0.21/0.66 % Estimated cpu time (8 cpus) : 207.0
% 0.21/0.72 % /export/starexec/sandbox2/solver/bin/lams/40_c.s.sh running for 80s
% 0.21/0.73 % /export/starexec/sandbox2/solver/bin/lams/35_full_unif4.sh running for 80s
% 1.32/0.75 % /export/starexec/sandbox2/solver/bin/lams/40_c_ic.sh running for 80s
% 1.32/0.75 % /export/starexec/sandbox2/solver/bin/lams/40_noforms.sh running for 90s
% 1.32/0.76 % /export/starexec/sandbox2/solver/bin/lams/40_b.comb.sh running for 70s
% 1.32/0.76 % /export/starexec/sandbox2/solver/bin/lams/15_e_short1.sh running for 30s
% 1.32/0.76 % /export/starexec/sandbox2/solver/bin/lams/20_acsne_simpl.sh running for 40s
% 1.32/0.77 % /export/starexec/sandbox2/solver/bin/lams/30_sp5.sh running for 60s
% 1.32/0.80 % /export/starexec/sandbox2/solver/bin/lams/30_b.l.sh running for 90s
% 1.44/0.86 % Solved by lams/30_sp5.sh.
% 1.44/0.86 % done 0 iterations in 0.067s
% 1.44/0.86 % SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
% 1.44/0.86 % SZS output start Refutation
% See solution above
% 1.44/0.86
% 1.44/0.86
% 1.44/0.86 % Terminating...
% 1.81/0.95 % Runner terminated.
% 1.81/0.97 % Zipperpin 1.5 exiting
%------------------------------------------------------------------------------